Simulated annealing via Sobolev inequalities
نویسندگان
چکیده
منابع مشابه
Fuzzy linear programming via simulated annealing
This paper shows how the simulated annealing (SA) algorithm provides a simple tool for solving fuzzy optimization problems. Often, the issue is not so much how to fuzzify or remove the conceptual imprecision, but which tools enable simple solutions for these intrinsically uncertain problems. A well-known linear programming example is used to discuss the suitability of the SA algorithm for solvi...
متن کاملAnalysis of kinesin mechanochemistry via simulated annealing
The molecular motor protein kinesin plays a key role in fundamental cellular processes such as intracellular transport, mitotic spindle formation, and cytokinesis, with important implications for neurodegenerative and cancer disease pathways. Recently, kinesin has been studied as a paradigm for the tailored design of nano-bio sensor and other nanoscale systems. As it processes along a microtubu...
متن کاملMultiple association analysis via simulated annealing (MASSA)
SUMMARY Genome-wide association studies are now technically feasible and likely to become a fundamental tool in unraveling the ultimate genetic basis of complex traits. However, new statistical and computational methods need to be developed to extract the maximum information in a realistic computing time. Here we propose a new method for multiple association analysis via simulated annealing tha...
متن کاملAsymptotics of the Porous Media Equation via Sobolev Inequalities
Let M be a compact Riemannian manifold without boundary. Consider the porous media equation u̇ = 4(um), u(0) = u0 ∈ Lq , 4 being the Laplace–Beltrami operator. Then, if q ≥ 2 ∨ (m − 1), the associated evolution is Lq − L∞ regularizing at any time t > 0 and the bound ‖u(t)‖∞ ≤ C(u0)/t (1) holds for t < 1 for suitable explicit C(u0), γ. For large t it is shown that, for general initial data, u(t) ...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 1988
ISSN: 0010-3616,1432-0916
DOI: 10.1007/bf01224127